List update processing (LUP)--solving the sequence database update problem.

نویسندگان

  • R Doelz
  • F Eggenberger
چکیده

Sequence databases of today require frequent updating. Mirror procedures to copy incrementally updated databases as cumulative sets are the preferred method and can be implemented by straightforward scripting. However, limited bandwidth of networks and the increase of data require more powerful paradigms to reduce the workload reliably. We suggest the List Update Processing (LUP) principle. The system has been implemented on an experimental basis to update the Swiss EMBnet Node (BioComputing Basel, CH) with data from the European Bioinformatics Institute (EMBL Outstation, Hinxton Hall, UK). The results obtained from the prototype suggest to expand the system to several sites.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Algorithms for Self-Organizing Sequential Search - A Survey

The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and randomized online algorithms and complexity result...

متن کامل

On Lookahead in the List Update Problem

Simha, R. and A. Majumdar, On Lookahead in the List Update Problem. Information Processing Letters. We study a problem in the area of self-adjusting data structures: algorithms for the singly-linked list for the case in which a sequence of operations is to be performed on the list and the entire sequence is known beforehand. Whereas past approaches assume that the cost of lookahead is zero, we ...

متن کامل

User Database Interaction: An Objective Abstraction Level Theory

ion levels that can be objectively distinguished and can be applied to smaller units. For example, current definitions of the conceptual level as a level for communications between user and analyst are not fully objective. Well-trained users and analysts may find the relational model easy for communication (Siau, 2004). Or people may simply have different opinions and preferences on the models ...

متن کامل

List Update Problem

We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure.

متن کامل

Mathematical Model and Algorithm for sequencing operations in the machine building industry

In this paper, the problem of sequencing machines in the final assembly line with regard to the supply of parts has been investigated. For this reason, a basic integer linear programming model has been developed and based on this, the problem-solving algorithm is developed in accordance with the reaction-based approach based on the renewal of the sequence of operations. Also, due to the Np-hard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing

دوره   شماره 

صفحات  -

تاریخ انتشار 1996